Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Deadlock")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 648

  • Page / 26
Export

Selection :

  • and

Turbocharging Boosted Transactions or: How I Learnt to Stop Worrying and Love Longer TransactionsKULKARNI, Chinmay; UNSAL, Osman; CRISTAL, Adrian et al.ACM SIGPLAN notices. 2009, Vol 44, Num 4, pp 307-308, issn 1523-2867, 2 p.Conference Paper

An evaluation of deadlock-handling strategies in semiconductor cluster toolsVENKATESH, Srilakshmi; SMITH, Jeffrey S.IEEE transactions on semiconductor manufacturing. 2005, Vol 18, Num 1, pp 197-201, issn 0894-6507, 5 p.Article

An effective routing algorithm in incomplete hypercubesSHU-HUA HU; HSING-LUNG CHEN.Parallel computing. 1994, Vol 20, Num 12, pp 1721-1738, issn 0167-8191Article

False deadlock detection in distributed systemsWUU, G. T; BERNSTEIN, A. J.IEEE transactions on software engineering. 1985, Vol 11, Num 8, pp 820-821, issn 0098-5589Article

Searching for deadlocks while debugging Concurrent Haskell programsCHRISTIANSEN, Jan; HUCH, Frank.ACM SIGPLAN notices. 2004, Vol 39, Num 9, pp 28-39, issn 1523-2867, 12 p.Conference Paper

Deadlocks and dihomotopy in mutual exclusion modelsRAUSSEN, Martin.Theoretical computer science. 2006, Vol 365, Num 3, pp 247-257, issn 0304-3975, 11 p.Conference Paper

Deadlock-free multicasting in irregular networks using prefix routingJIE WU; LI SHENG.Journal of supercomputing. 2005, Vol 31, Num 1, pp 63-78, issn 0920-8542, 16 p.Article

A New Modified Reachability Tree Approach and Its Applications to Unbounded Petri NetsSHOUGUANG WANG; MENGCHU ZHOU; ZHIWU LI et al.IEEE transactions on systems, man, and cybernetics. Systems (Print). 2013, Vol 43, Num 4, pp 932-940, issn 2168-2216, 9 p.Article

Reaching more states for control of FMSYUH CHAO, Daniel.International journal of production research. 2010, Vol 48, Num 3-4, pp 1217-1220, issn 0020-7543, 4 p.Article

A graphic-algebraic computation of elementary siphons of BS3PRYUH CHAO, Daniel.Journal of information science and engineering. 2007, Vol 23, Num 6, pp 1817-1831, issn 1016-2364, 15 p.Article

Information structures, causality, and nonsequential stochastic control. I : Design-independent propertiesANDERSLAND, M. S; TENEKETZIS, D.SIAM journal on control and optimization. 1992, Vol 30, Num 6, pp 1447-1475, issn 0363-0129Article

Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS3PR)CHAO, Daniel Yuh.Journal of information science and engineering. 2009, Vol 25, Num 6, pp 1963-1977, issn 1016-2364, 15 p.Article

On buffer-economical store-and-forward deadlock preventionAWERBUCH, B; KUTTEN, S; PELEG, D et al.IEEE transactions on communications. 1994, Vol 42, Num 11, pp 2934-2937, issn 0090-6778Article

Max'-controlled siphons for liveness of S3PGR2CHAO, D. Y.IET control theory & applications (Print). 2007, Vol 1, Num 4, pp 933-936, issn 1751-8644, 4 p.Article

Generalized conditions for liveness enforcement and deadlock prevention in Petri netsIORDACHE, Marian V; ANTSAKLIS, Panos J.Lecture notes in computer science. 2001, pp 184-203, issn 0302-9743, isbn 3-540-42252-8Conference Paper

Parallel discrete event simulation using shared memoryREED, D. A; MALONY, A. D; MCCREDIE, B. D et al.IEEE transactions on software engineering. 1988, Vol 14, Num 4, pp 541-553, issn 0098-5589Article

A distributed scheme for detecting communication deadlocksNATARAJAN, N.IEEE transactions on software engineering. 1986, Vol 12, Num 4, pp 531-537, issn 0098-5589Article

Static deadlock analysis for CSP-type communicationsLadkin, P.B; Simons, B.B.1994, 14 p.Report

Deadlock Detection and Recovery for True Fully Adaptive Routing in Regular Wormhole NetworksLEE, Soojung.Journal of information science and engineering. 2009, Vol 25, Num 2, pp 465-479, issn 1016-2364, 15 p.Article

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

Time-stamp approach to prevention of different deadlock types in store-and-forward networksBLAZEWICZ, J; BRZEZINSKI, J; GAMBOSI, G et al.IEEE transactions on communications. 1987, Vol 35, Num 5, pp 564-566, issn 0090-6778Article

An analytical model of adaptive wormhole routing with deadlock recoveryOULD-KHAOUA, M; KHONSARI, A.Lecture notes in computer science. 2000, pp 900-903, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Deadlock avoidance in FMS based on structural theory of Petri NetsBARKAOUI, K; ABDALLAH, I. B.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 499-510, isbn 0-7803-2535-4, 3VolConference Paper

An Implementation of mutual inclusionHOOGERWOORD, R. R.Information processing letters. 1986, Vol 23, Num 2, pp 77-80, issn 0020-0190Article

Pseudosimulation: an algorithm for distributed simulation with limited memoryGROSELJ, B; TROPPER, C.International journal of parallel programming. 1986, Vol 15, Num 5, pp 413-456, issn 0885-7458Article

  • Page / 26